Deterministic twirling with low resources

Randomness cost of symmetric twirling

We study random unitary channels which reproduce the action of the twirling channel corresponding to the representation of the symmetric group on an n-fold tensor product. We derive upper and lower bounds on the randomness cost of implementing such a map which depend exponentially on the number of systems. Consequently, symmetric twirling can be regarded as a reasonable Shannontheoretic protoco...

I-6: IVF in Low Resources Countries

Low-Deterministic Security For Low-Nondeterministic Programs

We present a new algorithm, together with a full soundness proof, which guarantees probabilistic noninterference (PN) for concurrent programs. The algorithm follows the “low-deterministic security” (LSOD) approach, but for the first time allows general low-nondeterminism as long as PN is not violated. The algorithm is based on the earlier observation by Giffhorn and Snelting that low-nondetermi...

Baton twirling: another cause of eye injury.

Baton twirling is an increasingly popular sport, with an estimated 5000 participants in Scotland alone. The baton, weighing over 200 g, is spun at high speeds and frequently thrown over 40 feet (12 m) into the air. We report a case of a 17-year-old girl who sustained a serious eye injury after being struck by a baton. The occurrence of eye injury has not been reported in this sport, and we disc...

Low energy adaptive clustering hierarchy with deterministic cluster-head selection

This paper focuses on reducing the power consumption of wireless microsensor networks. Therefore, a communication protocol named LEACH (Low-Energy Adaptive Clustering Hierarchy) is modified. We extend LEACH’s stochastic clusterhead selection algorithm by a deterministic component. Depending on the network configuration an increase of network lifetime by about 30 % can be accomplished. Furthermo...